Constrained randomization of weighted networks
نویسندگان
چکیده
منابع مشابه
Constrained Randomisation of Weighted Networks
We propose a Markov chain method to efficiently generate surrogate networks that are random under the constraint of given vertex strengths. With these strength-preserving surrogates and with edge-weight-preserving surrogates we investigate the clustering coefficient and the average shortest path length of functional networks of the human brain as well as of the International Trade Networks. We ...
متن کاملApproximating Directed Weighted-Degree Constrained Networks
Given a graph H = (V, F ) with edge weights {we : e ∈ F}, the weighted degree of a node v in H is ∑ {wvu : vu ∈ F}. We give bicriteria approximation algorithms for problems that seek to find a minimum cost directed graph that satisfies both intersecting supermodular connectivity requirements and weighted degree constraints. The input to such problems is a directed graph G = (V,E) with edge-cost...
متن کاملConstrained Randomization of Time Series Data
A new method is introduced to create artificial time sequences that fulfil given constraints but are random otherwise. Constraints are usually derived from a measured signal for which surrogate data are to be generated. They are fulfilled by minimizing a suitable cost function using simulated annealing. A wide variety of structures can be imposed on the surrogate series, including multivariate,...
متن کاملTop-down Randomization of Weighted Search Trees
Aragon and Seidel 1] presented a solution of the dictionary problem which became very popular in the last years. Their algorithm is easy to implement and fast in practice. The main idea consists in simulating a random input by randomly generated priorities assigned to each key. But this method has two substantial drawbacks. The rst one is the large dependence of the performance and correctness ...
متن کاملConstrained locally weighted clustering
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the local correlation structures: associate each cluster with an independent weighting vector and embed it in the subspace spanned by an adaptive combination of the dimensions. Our clustering algorithm takes advantage of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2011
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.84.026103